/LMAR=0/XLINE=3/FONT#0=BASL30/FONT#1=BASI30/FONT#2=BASB30/FONT#10=BAXM30/FONT#11=ZERO30/FONT#3=STA200/FONT#4=NGB25
␈↓ ↓H␈↓␈↓βS␈↓∧ Artificial Intelligence Laboratory, STANFORD UNIVERSITY, Stanford, California 94305

␈↓ ↓H␈↓∧Telephone 415 497-4430␈↓ 
¬March 13, 1978 




␈↓ ↓H␈↓Robert Cartwright
␈↓ ↓H␈↓Department of Computer Science
␈↓ ↓H␈↓Cornell University
␈↓ ↓H␈↓Upson Hall
␈↓ ↓H␈↓Ithaca, N.Y. 14853

␈↓ ↓H␈↓Dear Corky:

␈↓ ↓H␈↓        Your␈α
extended␈α
abstract␈α
turned␈α
up␈α
on␈α
my␈α
desk,␈α
and␈α
I␈α
read␈α
and␈α
understood␈α
it.␈α
 I␈α
like␈α
your
␈↓ ↓H␈↓complete␈αrecursive␈αprograms,␈αbut␈αI␈αthink␈αthink␈αthe␈αminimization␈αschema␈αwill␈αstill␈αbe␈αuseful.␈α I␈αam
␈↓ ↓H␈↓eager␈αto␈αsee␈αthe␈αdetails␈αof␈αhow␈αyou␈αdid␈αthe␈αcomplete␈αrecursive␈αprograms;␈αthe␈αexample␈αseems␈αa␈αbit
␈↓ ↓H␈↓kludgey.

␈↓ ↓H␈↓        I␈α∞enclose␈α∂a␈α∞sketch␈α∂of␈α∞the␈α∂generalization␈α∞and␈α∞two␈α∂forms␈α∞of␈α∂the␈α∞conjecture␈α∂that␈α∞conditional
␈↓ ↓H␈↓expressions␈α∩and␈α⊃parallel␈α∩or␈α⊃are␈α∩adequate␈α∩ways␈α⊃of␈α∩constructing␈α⊃continuous␈α∩functions␈α∩over␈α⊃∨at
␈↓ ↓H␈↓domains␈α
from␈α
strict␈α
functions.␈α
 I␈α
have␈α
tried␈α
to␈α
prove␈α
one␈α
or␈α
the␈α
other␈α
for␈α
about␈α
half␈α
a␈αday␈α
without
␈↓ ↓H␈↓success.


␈↓ ↓H␈↓Best regards,



␈↓ ↓H␈↓John McCarthy
␈↓ ↓H␈↓Director
␈↓ ↓H␈↓Professor of Computer Science